A lower bound for coherences on the Brown–Peterson spectrum

نویسندگان

  • BIRGIT RICHTER
  • Alan Robinson
  • Birgit Richter
چکیده

We provide a lower bound for the coherence of the homotopy commutativity of the Brown–Peterson spectrum, BP , at a given prime p and prove that it is at least (2p2 + 2p− 2)–homotopy commutative. We give a proof based on Dyer–Lashof operations that BP cannot be a Thom spectrum associated to n–fold loop maps to BSF for n = 4 at 2 and n = 2p + 4 at odd primes. Other examples where we obtain estimates for coherence are the Johnson–Wilson spectra, localized away from the maximal ideal and unlocalized. We close with a negative result on Morava-K –theory.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximal Independent Sets for the Pixel Expansion of Graph Access Structure

 Abstract : A visual cryptography scheme based on a given graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper a maximal independent sets of the graph G was ...

متن کامل

MAXIMAL INDEPENDENT SETS FOR THE PIXEL EXPANSION OF GRAPH ACCESS STRUCTURE

Given a graph G, a visual cryptography scheme based on the graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper we apply maximal independent sets of the grap...

متن کامل

Secondary power operations and the Brown–Peterson spectrum at the prime 2

The dual Steenrod algebra has a canonical subalgebra isomorphic to the homology of the Brown–Peterson spectrum. We will construct a secondary operation in mod-2 homology and show that this canonical subalgebra is not closed under it. This allows us to conclude that the 2-primary Brown–Peterson spectrum does not admit the structure of an En -algebra for any n ≥ 12, answering a question of May in...

متن کامل

A New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks

In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...

متن کامل

A New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks

In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009